Analyzing a multiserver bulk-service finite-buffer queue
نویسندگان
چکیده
منابع مشابه
Multiserver bulk service discrete-time queue with finite buffer and renewal input
This paper analyzes a discrete-time finite-buffer multi-server bulk-service queueing system in which the interarrival-and service-times are, respectively, arbitrarily and geometrically distributed. Using the supplementary variable and the imbedded Markov-chain techniques, the queue is analyzed for the early arrival system. We obtain state probabilities at prearrival, arbitrary and outside obser...
متن کاملFinite Buffer Bulk Service Queue with Multiple Vacations
In this paper, it is studied about finite buffer bulk service queue M/G (a,b) /1 with multiple vacations and some analytical results, relations among queue length distributions, computations of state probabilities at various epochs are included.
متن کاملOn a Multiserver Finite Buffer Queue with Impatient
In this paper we study a multiserver finite buffer queue in which customers have an stochastic deadline of phase-type until the beginning of their service. The following service disciplines are considered: FCFS (First-Come First-Served), LCFS (Last-Come First-Served) and SIRO (Service In Random Order) along with a parameterizable probabilistic push-out mechanism. Although this model has many ap...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملNote on Approximations for the Multiserver Queue with Finite Buffer and Deterministic Services
This article extends an earlier article by Tijms and Staats [3] in which approximations were obtained for state probabilities and the waiting times in the single server M/D/1/N queue with finite buffer and deterministic services. These approximation were provided in the form of explicit expressions involving geometric distributions and exponential densities. The underlying idea of the approxima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2008
ISSN: 0307-904X
DOI: 10.1016/j.apm.2007.06.017